The load factor \(\alpha\) measures how full the hash table is. To maintain performance, we rehash (resize and re-insert all keys) when \(\alpha\) exceeds a certain threshold.
$$\alpha = \frac{n}{m} = \frac{\text{number of keys}}{\text{table size}}$$